-
1 binary cryptosystem
криптосистема с двоичным ключом
—
[http://www.rfcmd.ru/glossword/1.8/index.php?a=index&d=23]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > binary cryptosystem
-
2 binary cryptosystem
Безопасность: двоичная криптосистема, криптосистема с двоичным ключом -
3 binary cryptosystem
двоичная криптосистема, криптосистема с двоичным ключомАнгло-русский словарь по компьютерной безопасности > binary cryptosystem
-
4 cryptosystem
криптографическая система, криптосистема; шифросистема- abuse-free cryptosystem- algebraic code cryptosystem- analog cryptosystem- asymmetric cryptosystem- asymmetric key cryptosystem- authentication/secrecy cryptosystem- bijective public key cryptosystem- binary cryptosystem- block cryptosystem- broadcast cryptosystem- broadcasting cryptosystem- cipher-feedback cryptosystem- classical cryptosystem- common-key cryptosystem- communication cryptosystem- compromised cryptosystem- computationally secure cryptosystem- conference cryptosystem- conventional cryptosystem- DES-based cryptosystem- DES-like cryptosystem- deterministic cryptosystem- DH cryptosystem- Diffie and Hellman cryptosystem- discrete-exponentiation cryptosystem- discrete log cryptosystem- E3 cryptosystem- effectively unbreakable cryptosystem- elliptic curve cryptosystem- endomorphic cryptosystem- end-to-end encryption cryptosystem- error propagating cryptosystem- factorization cryptosystem- finite cryptosystem- finite automation cryptosystem- Galois field cryptosystem- general cryptosystem- generalized cryptosystem- Goppa-code cryptosystem- hardware-implemented cryptosystem- hidden key cryptosystem- high-grade cryptosystem- high-speed cryptosystem- hybrid public-secret key cryptosystem- hybrid stream/block cryptosystem- identity-based cryptosystem- intractable cryptosystem- indecipherable cryptosystem- iterated cryptosystem- keyed cryptosystem- key escrow cryptosystem- key-minimal cryptosystem- knapsack-based cryptosystem- knapsack public key cryptosystem- matrix cryptosystem- McEliece' cryptosystem- Merkle-Hellman cryptosystem- MH cryptosystem- microprocessor based cryptosystem- minuend cryptosystem- multiple access cryptosystem- multiple destination cryptosystem- multiplicative knapsack cryptosystem- network cryptosystem- non-linear cryptosystem- number theoretic cryptosystem- one-key cryptosystem- one-master-key cryptosystem- one-time-key cryptosystem- one-time-pad cryptosystem- one-time-tape cryptosystem- perfect secrecy cryptosystem- practical security cryptosystem- private key cryptosystem- proprietary cryptosystem- provable secure cryptosystem- public key cryptosystem- public key distribution cryptosystem- public key signature cryptosystem- rapid cryptosystem- reciprocal number cryptosystem- residue cryptosystem- Rivest-Shamir-Adleman cryptosystem- rotor cryptosystem- RSA public key cryptosystem- r-th residue cryptosystem- secret-key cryptosystem- secure cryptosystem- shared key cryptosystem- shift register cryptosystem- single-key cryptosystem- sophisticated cryptosystem- split key cryptosystem- strong cryptosystem- subtractive cryptosystem- symmetric cryptosystem- theoretically unbreakable cryptosystem- threshold cryptosystem- transposition cryptosystem- trap-door-knapsack public key cryptosystem- transient key cryptosystem- threshold cryptosystem- two-key cryptosystem- unbreakable cryptosystem- voice cryptosystem- cryptosystem immune to cryptoanalysisАнгло-русский словарь по компьютерной безопасности > cryptosystem
См. также в других словарях:
McEliece cryptosystem — In cryptography, the McEliece cryptosystem is an asymmetric encryption algorithm developed in 1978 by Robert McEliece.[1] It was the first such scheme to use randomization in the encryption process. The algorithm has never gained much acceptance… … Wikipedia
Niederreiter cryptosystem — In cryptography, the Niederreiter cryptosystem is a variation of the McEliece Cryptosystem developed in 1986 by Harald Niederreiter [1]. It applies the same idea to the parity check matrix H of a linear code. Niederreiter is equivalent to… … Wikipedia
Paillier cryptosystem — The Paillier cryptosystem, named after and invented by Pascal Paillier in 1999, is a probabilistic asymmetric algorithm for public key cryptography. The problem of computing n th residue classes is believed to be computationally difficult. This… … Wikipedia
Merkle–Hellman knapsack cryptosystem — The Merkle–Hellman knapsack cryptosystem was one of the earliest public key cryptosystems invented by Ralph Merkle and Martin Hellman in 1978.[1] Although its ideas are elegant, and far simpler than RSA, it has been broken.[2] Contents 1… … Wikipedia
криптосистема с двоичным ключом — — [http://www.rfcmd.ru/glossword/1.8/index.php?a=index d=23] Тематики защита информации EN binary cryptosystem … Справочник технического переводчика
cryptology — cryptologist, n. cryptologic /krip tl oj ik/, cryptological, adj. /krip tol euh jee/, n. 1. cryptography. 2. the science and study of cryptanalysis and cryptography. [1635 45; < NL cryptologia. See CRYPTO , LOGY] * * * Introduction … Universalium
Cryptography — Secret code redirects here. For the Aya Kamiki album, see Secret Code. Symmetric key cryptography, where the same key is used both for encryption and decryption … Wikipedia
NTRUEncrypt — The NTRUEncrypt public key cryptosystem, also known as the NTRU encryption algorithm, is a lattice based alternative to RSA and ECC and is based on the shortest vector problem in a lattice (i.e. is not breakable using quantum computers).… … Wikipedia
Three-pass protocol — In cryptography, the three pass protocol for sending messages is a framework which allows one party to securely send a message to a second party without the need to exchange or distribute encryption keys. This message protocol should not be… … Wikipedia
Elliptic curve cryptography — (ECC) is an approach to public key cryptography based on the algebraic structure of elliptic curves over finite fields. The use of elliptic curves in cryptography was suggested independently by Neal Koblitz[1] and Victor S. Miller[2] in 1985.… … Wikipedia
Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… … Wikipedia
